A box decomposition algorithm to compute the hypervolume indicator

We propose a new approach to the computation of the hypervolume indicator, based on partitioning the dominated region into a set of axis-parallel hyperrectangles or boxes. We present a nonincremental algorithm and an incremental algorithm, which allows insertions of points, whose time complexities are O(nb p−1 2 c+1) and O(nb p 2 c+1), respectively. While the theoretical complexity of such a method is lower bounded by the complexity of the partition, which is, in the worst-case, larger than the best upper bound on the complexity of the hypervolume computation, we show that it is practically efficient. In particular, the nonincremental algorithm competes with the currently most practically efficient algorithms. Finally, we prove an enhanced upper bound of O(np−1) and a lower bound of Ω(nb p 2 c log n) for p ≥ 4 on the worst-case complexity of the WFG algorithm.